Improved competitive algorithms for online scheduling with partial job values
نویسندگان
چکیده
منابع مشابه
Improved online algorithms for parallel job scheduling and strip packing
We consider the online scheduling problem of parallel jobs on parallel machines, P |online − list,mj|Cmax. For this problem we present a 6.6623-competitive algorithm. This improves the best known 7-competitive algorithm for this problem. The presented algorithm also applies to the problem where machines are ordered on a line and only adjacent machines can be assigned to a job and, therefore, al...
متن کاملCompetitive algorithms for multistage online scheduling
We study an online flow shop scheduling problem where each job consists of several tasks that have to be completed in t different stages and the goal is to maximize the total weight of accepted jobs. The set of tasks of a job contains one task for each stage and each stage has a dedicated set of identical parallel machines corresponding to it that can only process tasks of this stage. In order ...
متن کاملA Competitive Online Algorithm for a Parallel Job Scheduling Problem
We study a parallel job scheduling problem in which parallel jobs may be assigned to any number of processors in a parallel computing system. If a job of size p j is assigned to k j processors, its running time is assumed to be p j=k j + k jc, where c is a constant representing communication overhead for each processor. This model explicitly takes into account the increase in overhead arising f...
متن کاملImproved upper bounds for online malleable job scheduling
In this paper, we study online algorithms that schedule malleable jobs, i.e., jobs that can be parallelized on any subset of the available m identical machines. We study a model that accounts for the tradeoff between multiprocessor speedup and overhead time, namely, if job j has processing requirement pj and is assigned to run on kj machines, then j’s execution time becomes pj/kj + (kj 1)c, whe...
متن کاملOnline algorithms for temperature aware job scheduling problems
Temperature is an important consideration when designing microprocessors. When exposed to high temperatures component reliability can be reduced, while some components completely fail over certain temperatures. We consider the design and analysis of online algorithms; in particular algorithms that use knowledge of the amount of heat a job will generate. We consider algorithms with two main obje...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.02.046